Termination w.r.t. Q proof of TRS/SK904.07.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

*(i(x), x) → 1
*(1, y) → y
*(x, 0) → 0
*(*(x, y), z) → *(x, *(y, z))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

*(i(x), x) → 1
*(1, y) → y
*(x, 0) → 0
*(*(x, y), z) → *(x, *(y, z))

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

[*₂, 0] > [i₁, 1]

Status:

i₁: [1]
1: multiset
0: multiset
*₂: [1,2]